n=int(input())
for i in range(0,n):
k=int(input())
s=input()
if len(s)==1:
if int(s)%2==0:
print(2)
else:
print(1)
else:
if k%2!=0:
c=0
for i in range(0,k,2):
if int(s[i])%2!=0:
c+=1
if c>=1:
print(1)
else:
print(2)
else:
c=0
for i in range(1,k,2):
if int(s[i])%2==0:
c+=1
if c>=1:
print(2)
else:
print(1)
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define mod 1000000007
#define pb push_back
int main (){
int t;
cin>>t;
while(t--){
int n;
cin>>n;
string s=" ";
int flag1=0;
int flag2=0;
for(int i=0;i<n;i++){
char c;
cin>>c;
s=s+c;
}
if(n==1){
if((s[1]-'0')%2==0) {cout<<2<<endl;
continue;
}
else{ cout<<1<<endl;
continue;
}
}
for(int i=1;i<=n;i++){
if(i%2==0 && (s[i]-'0')%2==0) flag1=1;
if(i%2==1 && (s[i]-'0')%2==1) flag2=1;
}
if(n&1) {
if(flag2==0) cout<<2<<endl;
else cout<<1<<endl;
}
else {
if(flag1==0) cout<<1<<endl;
else cout<<2<<endl;
}
}
return 0;
}2085. Count Common Words With One Occurrence | 2089. Find Target Indices After Sorting Array |
2090. K Radius Subarray Averages | 2091. Removing Minimum and Maximum From Array |
6. Zigzag Conversion | 1612B - Special Permutation |
1481. Least Number of Unique Integers after K Removals | 1035. Uncrossed Lines |
328. Odd Even Linked List | 1219. Path with Maximum Gold |
1268. Search Suggestions System | 841. Keys and Rooms |
152. Maximum Product Subarray | 337. House Robber III |
869. Reordered Power of 2 | 1593C - Save More Mice |
1217. Minimum Cost to Move Chips to The Same Position | 347. Top K Frequent Elements |
1503. Last Moment Before All Ants Fall Out of a Plank | 430. Flatten a Multilevel Doubly Linked List |
1290. Convert Binary Number in a Linked List to Integer | 1525. Number of Good Ways to Split a String |
72. Edit Distance | 563. Binary Tree Tilt |
1306. Jump Game III | 236. Lowest Common Ancestor of a Binary Tree |
790. Domino and Tromino Tiling | 878. Nth Magical Number |
2099. Find Subsequence of Length K With the Largest Sum | 1608A - Find Array |